Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

A note on the continuous mixing setZHAO, M; DE FARIAS, I. R.Operations research letters. 2008, Vol 36, Num 6, pp 726-733, issn 0167-6377, 8 p.Article

Solving capacitated arc routing problems using a transformation to the CVRPLONGO, Humberto; POGGI DE ARAGAO, Marcus; UCHOA, Eduardo et al.Computers & operations research. 2006, Vol 33, Num 6, pp 1823-1837, issn 0305-0548, 15 p.Article

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliverySUBRAMANIAN, Anand; UCHOA, Eduardo; ALVES PESSOA, Artur et al.Operations research letters. 2011, Vol 39, Num 5, pp 338-341, issn 0167-6377, 4 p.Article

New formulations and valid inequalities for a bilevel pricing problemDEWEZ, Sophie; LABBD, Martine; MARCOTTE, Patrice et al.Operations research letters. 2008, Vol 36, Num 2, pp 141-149, issn 0167-6377, 9 p.Article

A branch-and-cut algorithm for the pallet loading problemALVAREZ-VALDES, R; PARRENO, F; TAMARIT, J. M et al.Computers & operations research. 2005, Vol 32, Num 11, pp 3007-3029, issn 0305-0548, 23 p.Article

Combinatorial algorithms for the maximum k-plex problemMCCLOSKY, Benjamin; HICKS, Illya V.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 29-49, issn 1382-6905, 21 p.Article

A branch and cut algorithm for the hierarchical network design problemOBREQUE, Carlos; DONOSO, Macarena; GUTIERREZ, Gabriel et al.European journal of operational research. 2010, Vol 200, Num 1, pp 28-35, issn 0377-2217, 8 p.Article

An exact approach for the vehicle routing problem with two-dimensional loading constraintsIORI, Manuel; SALAZAR-GONZALEZ, Juan-José; VIGO, Daniele et al.Transportation science. 2007, Vol 41, Num 2, pp 253-264, issn 0041-1655, 12 p.Article

On the domino-parity inequalities for the STSPBOYD, Sylvia; COCKBURN, Sally; VELLA, Danielle et al.Mathematical programming. 2007, Vol 110, Num 3, pp 501-519, issn 0025-5610, 19 p.Article

A branch-and-cut algorithm for multiple sequence alignmentALTHAUS, Ernst; CAPRARA, Alberto; LENHOF, Hans-Peter et al.Mathematical programming. 2006, Vol 105, Num 2-3, pp 387-425, issn 0025-5610, 39 p.Article

A branch-and-cut algorithm for scheduling of projects with variable-intensity activitiesKIS, Tamas.Mathematical programming. 2005, Vol 103, Num 3, pp 515-539, issn 0025-5610, 25 p.Article

Solving the Close-Enough Arc Routing ProblemMINH HOANG HA; BOSTEL, Nathalie; LANGEVIN, André et al.Networks (New York, NY). 2014, Vol 63, Num 1, pp 107-118, issn 0028-3045, 12 p.Conference Paper

The Multi-commodity Pickup-and-Delivery Traveling Salesman ProblemHERNANDEZ-PEREZ, Hipólito; SALAZAR-GONZALEZ, Juan-José.Networks (New York, NY). 2014, Vol 63, Num 1, pp 46-59, issn 0028-3045, 14 p.Conference Paper

The Orienteering Problem with Variable ProfitsERDOGAN, Güneş; LAPORTE, Gilbert.Networks (New York, NY). 2013, Vol 61, Num 2, pp 104-116, issn 0028-3045, 13 p.Conference Paper

An exact approach to the problem of extracting an embedded network matrixFIGUEIREDO, Rosa M. V; LABBE, Martine; DE SOUZA, Cid C et al.Computers & operations research. 2011, Vol 38, Num 11, pp 1483-1492, issn 0305-0548, 10 p.Article

A branch-and-cut algorithm for the Winner Determination ProblemESCUDERO, Laureano F; LANDETE, Mercedes; MARIN, Alfredo et al.Decision support systems. 2009, Vol 46, Num 3, pp 649-659, issn 0167-9236, 11 p.Article

On the graphical relaxation of the symmetric traveling salesman polytopeOSWALD, Marcus; REINELT, Gerhard; THEIS, Dirk Oliver et al.Mathematical programming. 2007, Vol 110, Num 1, pp 175-193, issn 0025-5610, 19 p.Conference Paper

Models and branch-and-cut algorithms for pickup and delivery problems with time windowsROPKE, Stefan; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.Networks (New York, NY). 2007, Vol 49, Num 4, pp 258-272, issn 0028-3045, 15 p.Conference Paper

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problemYONGPEI GUAN; AHMED, Shabbir; NEMHAUSER, George L et al.Mathematical programming. 2006, Vol 105, Num 1, pp 55-84, issn 0025-5610, 30 p.Article

Combinatorial benders' cuts for mixed-integer linear programmingCODATO, Gianni; FISCHETTI, Matteo.Operations research. 2006, Vol 54, Num 4, pp 756-766, issn 0030-364X, 11 p.Article

A class of solution-invariant transformations of cost functions for minimum cost flow phase unwrappingHUBIG, Michael; SUCHANDT, Steffen; ADAM, Nico et al.Journal of the Optical Society of America. A, Optics, image science, and vision (Print). 2004, Vol 21, Num 10, pp 1975-1987, issn 1084-7529, 13 p.Article

A branch-and-cut algorithm for the hub location and routing problemRODRIGUEZ-MARTIN, Inmaculada; SALAZAR-GONZALEZ, Juan-José; YAMAN, Hande et al.Computers & operations research. 2014, Vol 50, pp 161-174, issn 0305-0548, 14 p.Article

An exact method for solving the manufacturing cell formation problemELBENANI, Bouazza; FERLAND, Jacques A.International journal of production research. 2012, Vol 50, Num 14-16, pp 4038-4045, issn 0020-7543, 8 p.Article

The pyramidal capacitated vehicle routing problemLYSGAARD, Jens.European journal of operational research. 2010, Vol 205, Num 1, pp 59-64, issn 0377-2217, 6 p.Article